Variable Bias Coin Tossing
نویسندگان
چکیده
Alice is a charismatic quantum cryptographer who believes her parties are unmissable; Bob is a glamorous string theorist who believes he is an indispensable guest. To prevent possibly traumatic collisions of self-perception and reality, their social code requires that decisions about invitation or acceptance be made via a cryptographically secure variable bias coin toss (VBCT). This generates a shared random bit by the toss of a coin whose bias is secretly chosen, within a stipulated range, by one of the parties; the other party learns only the random bit. Thus one party can secretly influence the outcome, while both can save face by blaming any negative decisions on bad luck. We describe here some cryptographic VBCT protocols whose security is guaranteed by quantum theory and the impossibility of superluminal signalling, setting our results in the context of a general discussion of secure two-party computation. We also briefly discuss other cryptographic applications of VBCT.
منابع مشابه
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
Coin tossing is a basic cryptographic task that allows two distrustful parties to obtain an unbiased random bit in a way that neither party can bias the output by deviating from the protocol or halting the execution. Cleve [STOC’86] showed that in any r round coin tossing protocol one of the parties can bias the output by Ω(1/r) through a “fail-stop” attack; namely, they simply execute the prot...
متن کاملProtocols for Multiparty Coin Toss with Dishonest Majority
Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols. Cleve [STOC 1986] has shown that if at least half of the parties can be malicious, then, in any r-round coin-tossing protocol, the malicious parties can cause a bias of Ω(1/r) to the bit that the honest parties output. However, ...
متن کاملQuantum And Relativistic Protocols For Secure Multi-Party Computation
Secure multi-party computation is a task whereby mistrustful parties attempt to compute some joint function of their private data in such a way as to reveal as little as possible about it. It encompasses many cryptographic primitives, including coin tossing and oblivious transfer. Ideally, one would like to generate either a protocol or a no-go theorem for any such task. Very few computations o...
متن کاملHonesty can be the best policy within quantum mechanics
Honesty has never been scientifically proved to be the best policy in any case. It is pointed out that only honest person can prevent his dishonest partner to bias the outcome of quantum coin tossing. Honesty is said to be the best policy. However, in many cases honest persons are the loser and dishonest persons are the winner. In support of the honest losers let us imagine a case where honest ...
متن کاملAlmost-Optimally Fair Multiparty Coin-Tossing
An α-fair coin-tossing protocol allows a set of mutually distrustful parties to generate a uniform bit, such that no efficient adversary can bias the output bit by more than α. Cleve [STOC 1986] has shown that if half of the parties can be corrupted, then, no r-round coin-tossing protocol is o(1/r)-fair. For over two decades the best known m-party protocols, tolerating up to t ≥ m/2 corrupted p...
متن کاملHow to Lose with Least Probability
Two players alternate tossing a biased coin where the probability of getting heads is p. The current player is awarded α points for tails and α + β for heads. The first player reaching n points wins. For a completely unfair coin the player going first certainly wins. For other coin biases, the player going first has the advantage, but the advantage depends on the coin bias. We calculate the fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/quant-ph/0508149 شماره
صفحات -
تاریخ انتشار 2005